Uncapacitated lot sizing with backlogging: the convex hull
نویسندگان
چکیده
An explicit description of the convex hull of solutions to the uncapacitated lot-sizing problem with backlogging, in its natural space of production, setup, inventory and backlogging variables, has been an open question for many years. In this paper, we identify valid inequalities that subsume all previously known valid inequalities for this problem. We show that these inequalities are enough to describe the convex hull of solutions. We give polynomial separation algorithms for some special cases. Finally, we report a summary of computational experiments with our inequalities that illustrates their effectiveness.
منابع مشابه
Core Discussion Paper 9917 the Uncapacitated Lot-sizing Problem with Sales and Safety Stocks
We examine a variant of the uncapacitated lot-sizing model of WagnerWhitin involving sales instead of fixed demands, and lower bounds on stocks. Two extended formulations are presented, as well as a dynamic programming algorithm and a complete description of the convex hull of solutions. When the lower bounds on stocks are non-decreasing over time, it is possible to describe an extended formula...
متن کاملPolyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
We consider a production planning problem for two items where the high quality item can substitute the demand for the low quality item. Given the number of periods, the demands, the production, inventory holding, setup and substitution costs, the problem is to find a minimum cost production and substitution plan. This problem generalizes thewell-known uncapacitated lot-sizing problem.We study t...
متن کاملA Note on "Lot-sizing with fixed charges on stocks: The convex hull"
We update and complete the proof of Proposition 7 in Van Vyve and Ortega (2004), which states that the projection of a facility location reformulation of an uncapacitated lot sizing problem with fixed charges on stocks (ULSW) to the original space is equivalent to that of the tight shortest path reformulation of ULSW. Their proof is interesting and consists of two cases, only first of which is ...
متن کاملAlgorithms for Stochastic Lot-Sizing Problems with Backlogging
As a traditional model in the operations research and management science domain, deterministic lot-sizing problem is embedded in many application problems such as production and inventory planning and has been consistently drawing attentions from researchers. In this paper we consider basic versions of lot-sizing models in which problem parameters are stochastic and develop corresponding scenar...
متن کاملMixing Sets Linked by Bidirected Paths
Recently there has been considerable research on simple mixed-integer sets, called mixing sets, and closely related sets arising in uncapacitated and constant capacity lot-sizing. This in turn has led to study of more general sets, called network-dual sets, for which it is possible to derive extended formulations whose projection gives the convex hull of the network-dual set. Unfortunately this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 118 شماره
صفحات -
تاریخ انتشار 2009